Computing a Solution for the Subset Sum Problem with a Light Based Device
Identifieur interne : 000992 ( Main/Exploration ); précédent : 000991; suivant : 000993Computing a Solution for the Subset Sum Problem with a Light Based Device
Auteurs : Raqibul Hasan [Bangladesh] ; Sohel Rahman [Bangladesh, Royaume-Uni]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
Abstract
Abstract: We propose a new way for computing a solution to the subset sum problem. Here, we use a special computational device which uses light ray. The device has a graph-like representation and the light traverses it by following the routes given by the connections between nodes. Our device can solve the subset sum decision problem as well as can compute a solution instance for it.
Url:
DOI: 10.1007/978-3-642-10442-8_9
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001875
- to stream Istex, to step Curation: 001777
- to stream Istex, to step Checkpoint: 000514
- to stream Main, to step Merge: 000A00
- to stream Main, to step Curation: 000992
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Computing a Solution for the Subset Sum Problem with a Light Based Device</title><author><name sortKey="Hasan, Raqibul" sort="Hasan, Raqibul" uniqKey="Hasan R" first="Raqibul" last="Hasan">Raqibul Hasan</name></author><author><name sortKey="Rahman, Sohel" sort="Rahman, Sohel" uniqKey="Rahman S" first="Sohel" last="Rahman">Sohel Rahman</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:2D1F50EBF9FDA98F5391D8BDEA9E3390EE8C1693</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-10442-8_9</idno><idno type="url">https://api.istex.fr/document/2D1F50EBF9FDA98F5391D8BDEA9E3390EE8C1693/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001875</idno><idno type="wicri:Area/Istex/Curation">001777</idno><idno type="wicri:Area/Istex/Checkpoint">000514</idno><idno type="wicri:doubleKey">0302-9743:2009:Hasan R:computing:a:solution</idno><idno type="wicri:Area/Main/Merge">000A00</idno><idno type="wicri:Area/Main/Curation">000992</idno><idno type="wicri:Area/Main/Exploration">000992</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Computing a Solution for the Subset Sum Problem with a Light Based Device</title><author><name sortKey="Hasan, Raqibul" sort="Hasan, Raqibul" uniqKey="Hasan R" first="Raqibul" last="Hasan">Raqibul Hasan</name><affiliation wicri:level="1"><country xml:lang="fr">Bangladesh</country><wicri:regionArea>Department of CSE, BUET, 1000, Dhaka</wicri:regionArea><wicri:noRegion>Dhaka</wicri:noRegion></affiliation><affiliation><wicri:noCountry code="no comma">E-mail: raqib_cse@yahoo.com</wicri:noCountry></affiliation></author><author><name sortKey="Rahman, Sohel" sort="Rahman, Sohel" uniqKey="Rahman S" first="Sohel" last="Rahman">Sohel Rahman</name><affiliation wicri:level="1"><country xml:lang="fr">Bangladesh</country><wicri:regionArea>Department of CSE, BUET, 1000, Dhaka</wicri:regionArea><wicri:noRegion>Dhaka</wicri:noRegion></affiliation><affiliation wicri:level="2"><country>Royaume-Uni</country><placeName><region type="country">Angleterre</region></placeName><wicri:cityArea>Algorithm Design Group, Department of Computer Science, King’s College London, WC2R 2LS, Strand, London</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Bangladesh</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">2D1F50EBF9FDA98F5391D8BDEA9E3390EE8C1693</idno><idno type="DOI">10.1007/978-3-642-10442-8_9</idno><idno type="ChapterID">9</idno><idno type="ChapterID">Chap9</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We propose a new way for computing a solution to the subset sum problem. Here, we use a special computational device which uses light ray. The device has a graph-like representation and the light traverses it by following the routes given by the connections between nodes. Our device can solve the subset sum decision problem as well as can compute a solution instance for it.</div></front></TEI><affiliations><list><country><li>Bangladesh</li><li>Royaume-Uni</li></country><region><li>Angleterre</li></region></list><tree><country name="Bangladesh"><noRegion><name sortKey="Hasan, Raqibul" sort="Hasan, Raqibul" uniqKey="Hasan R" first="Raqibul" last="Hasan">Raqibul Hasan</name></noRegion><name sortKey="Rahman, Sohel" sort="Rahman, Sohel" uniqKey="Rahman S" first="Sohel" last="Rahman">Sohel Rahman</name><name sortKey="Rahman, Sohel" sort="Rahman, Sohel" uniqKey="Rahman S" first="Sohel" last="Rahman">Sohel Rahman</name></country><country name="Royaume-Uni"><region name="Angleterre"><name sortKey="Rahman, Sohel" sort="Rahman, Sohel" uniqKey="Rahman S" first="Sohel" last="Rahman">Sohel Rahman</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000992 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000992 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:2D1F50EBF9FDA98F5391D8BDEA9E3390EE8C1693
|texte= Computing a Solution for the Subset Sum Problem with a Light Based Device
}}
| This area was generated with Dilib version V0.6.32. |  |